Full subgraphs
نویسندگان
چکیده
منابع مشابه
Full subgraphs
Let G = (V,E) be a graph of density p on n vertices. Following Erdős, Luczak and Spencer [11], an m-vertex subgraph H of G is called full if H has minimum degree at least p(m − 1). Let f(G) denote the order of a largest full subgraph of G. If p ( n 2 ) is a positive integer, define fp(n) = min{f(G) : |V (G)| = n, |E(G)| = p ( n 2 ) }. Erdős, Luczak and Spencer [11] proved that if p = 1 2 , then...
متن کاملBipartite Subgraphs
It is shown that there exists a positive c so that for any large integer m, any graph with 2m 2 edges contains a bipartite subgraph with at least m 2 + m/2 + c √ m edges. This is tight up to the constant c and settles a problem of Erd˝ os. It is also proved that any triangle-free graph with e > 1 edges contains a bipartite subgraph with at least e 2 + c e 4/5 edges for some absolute positive co...
متن کاملSubgraphs decomposable into two trees and k-edge-connected subgraphs
Given a complete graph with edge weights that satisfy the triangle inequality, we bound the minimum cost of a subgraph which is the union of two spanning trees in terms of the minimum cost of a k-edge-connected subgraph, for k ≤ 4.
متن کاملMaxmaxflow and Counting Subgraphs
We introduce a new graph invariant Λ(G) that we call maxmaxflow, and put it in the context of some other well-known graph invariants, notably maximum degree and its relatives. We prove the equivalence of two “dual” definitions of maxmaxflow: one in terms of flows, the other in terms of cocycle bases. We then show how to bound the total number (or more generally, total weight) of various classes...
متن کاملDiscovering Geometric Frequent Subgraphs
As data mining techniques are being increasingly applied to non-traditional domains, existing approaches for finding frequent itemsets cannot be used as they cannot model the requirement of these domains. An alternate way of modeling the objects in these data sets, is to use a graph to model the database objects. Within that model, the problem of finding frequent patterns becomes that of discov...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Graph Theory
سال: 2017
ISSN: 0364-9024,1097-0118
DOI: 10.1002/jgt.22221